Landmark transfer with minimal graph
نویسندگان
چکیده
منابع مشابه
Landmark transfer with minimal graph
We present an efficient and robust algorithm for the landmark transfer on 3D meshes that are approximately isometric. Given one or more custom landmarks placed by the user on a source mesh, our method efficiently computes corresponding landmarks on a family of target meshes. The technique is useful when a user is interested in characterization and reuse of application-specific landmarks on mesh...
متن کاملLandmark Extraction via Planning Graph Propagation
The planner GRAPHPLAN is based on an efficient propagation of reachability information which then effectively guides a search for a valid plan. We propose a framework in which a broader class of information, including the original reachability information, can be propagated in the plan graph in polynomial time. As an example, we exhibit an algorithm for propagating “landmark” information, where...
متن کاملthe common minimal dominating signed graph
in this paper, we define the common minimal dominating signed graph of a given signed graph and offer a structural characterization of common minimal dominating signed graphs. in the sequel, we also obtained switching equivalence characterizations: $overline{s} sim cmd(s)$ and $cmd(s) sim n(s)$, where $overline{s}$, $cmd(s)$ and $n(s)$ are complementary signed gra...
متن کاملMinimal State Graph Generation
We address the problem of generating a minimal state graph from a program, without building the whole state graph. Minimality is considered here with respect to bisimulation. A generation algorithm is derived and illustrated. Applications concern program veri cation and control synthesis in reactive program compilation.
متن کاملMinimal State Graph Generation
We address the problem of generating a minimal state graph from a program, without building the whole state graph. Minimality is considered here with respect to bisimulation. A generation algorithm is derived and illustrated. Applications concern program veriication and control synthesis in reactive program compilation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Graphics
سال: 2013
ISSN: 0097-8493
DOI: 10.1016/j.cag.2013.04.005